A modification of Graham’s algorithm for determining the convex hull of a finite planar set
نویسنده
چکیده
In this paper, in our modification of Graham scan for determining the convex hull of a finite planar set, we show a restricted area of the examination of points and its advantage. The actual run times of our scan and Graham scan on the set of random points shows that our modified algorithm runs significantly faster than Graham’s one.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملEducation and out of the box thinking – linearization of Graham’s scan algorithm complexity as fruit of education policy
The question of educational policy is considered with reference to its effect on student creativity. An example of this effect is presented – the linearization of Graham’s scan algorithm. The linearzation is described in detail with reference to how varying aspects of it originate with the original educational environment.The Graham’s Scan approach to two-dimensional convex hull calculation is ...
متن کامل7. Acknowledgments 8. References 6. Concluding Remarks
Optimal algorithms for computing the minimum distance between two finite planar sets, " Proc. A fast algorithm for the planar convex hull problem, " internal manuscript, [25] B. K. Bhattacharya and G. T. Toussaint. " A time-and-storage efficient implementation of an optimal planar convex hull algorithm, " Divide and conquer for linear expected time, " Inform. A linear algorithm for finding the ...
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملA First Algorithm: Planar Convex Hulls
We will start with a simple geometric problem, the computation of the convex hull of a finite set of points in the plane. We will formulate a basic algorithm that constructs the planar hull in quadratic time. It accesses the input points through a single predicate, the orientation predicate for three points. We will see how this predicate can be realized by a simple formula in the point coordin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008